A Novel Sampling Method Based on Normal Search Particle Swarm Optimization for Active Learning Reliability Analysis

نویسندگان

چکیده

In active learning reliability methods, an approximation of limit state function (LSF) with high precision is the key to accurately calculating failure probability (Pf). However, existing sampling methods cannot guarantee that candidate samples can approach LSF actively, which lowers accuracy and stability results causes excess computational effort. this paper, a novel samples-generating algorithm was proposed, by group evenly distributed points on predicted performance (either real one or surrogate model) could be obtained. proposed method, determination considered as optimization problem in absolute value objective function. After this, normal search particle swarm (NSPSO) designed deal such problems, consists pattern multi-strategy framework ensures uniform distribution diversity solution intends cover optimal region. Four explicit functions two engineering cases were employed verify effectiveness NSPSO method. state-of-the-art multi-modal algorithms used competitive methods. Analysis show method outperformed all provide LSF.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

RELIABILITY-BASED DESIGN OPTIMIZATION OF COMPLEX FUNCTIONS USING SELF-ADAPTIVE PARTICLE SWARM OPTIMIZATION METHOD

A Reliability-Based Design Optimization (RBDO) framework is presented that accounts for stochastic variations in structural parameters and operating conditions. The reliability index calculation is itself an iterative process, potentially employing an optimization technique to find the shortest distance from the origin to the limit-state boundary in a standard normal space. Monte Carlo simulati...

متن کامل

A Novel Particle Swarm-based Method for Nonlinear Function Optimization

This paper proposes a hybrid Particle Swarm Optimization (PSO) method, which is based on the fusion of the PSO, Clonal Selection Algorithm (CSA), and Mind Evolutionary Computation (MEC). The clone function borrowed from the CSA and MEC-characterized similartaxis and dissimilation operations are embedded in the original PSO algorithm. Simulations of nonlinear function optimization are made to co...

متن کامل

Particle Swarm Optimization Based Learning Method for Process Neural Networks

This paper proposes a new learning method for process neural networks (PNNs) based on the Gaussian mixture functions and particle swarm optimization (PSO), called PSO-LM. First, the weight functions of the PNNs are specified as the generalized Gaussian mixture functions (GGMFs). Second, a PSO algorithm is used to optimize the parameters, such as the order of GGMFs, the number of hidden neurons,...

متن کامل

A novel particle swarm optimization algorithm based on particle migration

Inspired by the migratory behavior in the nature, a novel particle swarm optimization algorithm based on particle migration (MPSO) is proposed in this work. In this new algorithm, the population is randomly partitioned into several sub-swarms, each of which is made to evolve based on particle swarm optimization with time varying inertia weight and acceleration coefficients (LPSO-TVAC). At perio...

متن کامل

A novel hybrid charge system search and particle swarm optimization method for multi-objective optimization

In this paper a newhybridmethod is proposed formulti-objective optimization problem. Inmulti-objective particle swarm optimization methods, selecting the global best particle for each particle of the population from a set of Pareto-optimal solutions has a great impact on the convergence and diversity of solutions. Here, this problem is solved by incorporating charged system search method into t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Applied sciences

سال: 2023

ISSN: ['2076-3417']

DOI: https://doi.org/10.3390/app13106323